On the Odir iterative method for non-symmetric indefinite linear systems

نویسندگان

  • Anthony T. Chronopoulos
  • David Kincaid
چکیده

Several Krylov subspace iterative methods have been proposed for the approximation of the solution of general non-symmetric linear systems. Odir is such a method. Here we study the restarted version of Odir for non-symmetric inde nite linear systems and we prove convergence under certain conditions on the matrix of coe cients. These results hold for all the restarted Krylov methods equivalent to Odir. We also introduce a new truncated Odir method which is proved to converge for a large class of non-symmetric inde nite linear systems. This new method requires one-half of the storage of the standard Odir. Copyright ? 2001 John Wiley & Sons, Ltd.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Hermitian positive definite systems using indefinite incomplete factorizations

Incomplete LDL factorizations sometimes produce an indefinite preconditioner evenwhen the input matrix is Hermitian positive definite. The two most popular iterative solvers for symmetric systems, CG and MINRES, cannot use such preconditioners; they require a positive definite preconditioner. One approach, that has been extensively studied to address this problem is to force positive definitene...

متن کامل

On solving sparse symmetric linear systems whose definiteness is unknown

Solving a large, sparse, symmetric linear system Ax = b iteratively must use appropriate methods. The conjugate gradient (CG) method can break down if A is indefinite while algorithms such as SYMMLQ and MINRES, though stable for indefinite systems, are computationally more expensive than CG when applied to positive definite matrices. In this paper, we present an iterative method for the case wh...

متن کامل

Robust Preconditioned Iterative So- lution Methods for Large-scale Non- symmetric Problems

We study robust, preconditioned, iterative solution methods for largescale linear systems of equations, arising from different applications in geophysics and geotechnics. The first type of linear systems studied here, which are dense, arise from a boundary element type of discretization of crack propagation in brittle material. Numerical experiment show that simple algebraic preconditioning str...

متن کامل

Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation

Introduction Fractional differential equations (FDEs)  have  attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme  may be a good approach, particularly, the schemes in numerical linear algebra for solving ...

متن کامل

Preconditioning Indefinite Systems in Interior-Point Methods for quadratic optimization

A new class of preconditioners is proposed for the iterative solution of symmetric indefinite systems arising from interior-point methods. The use of logarithmic barriers in interior point methods causes unavoidable ill-conditioning of linear systems and, hence, iterative methods fail to provide sufficient accuracy unless appropriately preconditioned. Now we introduce two types of preconditione...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Numerical Lin. Alg. with Applic.

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2001